NGO-GM: Natural Gradient Optimization for Graphical Models
نویسندگان
چکیده
منابع مشابه
MOEA/D-GM: Using probabilistic graphical models in MOEA/D for solving combinatorial optimization problems
Evolutionary algorithms based on modeling the statistical dependencies (interactions) between the variables have been proposed to solve a wide range of complex problems. These algorithms learn and sample probabilistic graphical models able to encode and exploit the regularities of the problem. This paper investigates the effect of using probabilistic modeling techniques as a way to enhance the ...
متن کاملTrue Asymptotic Natural Gradient Optimization
We introduce a simple algorithm, True Asymptotic Natural Gradient Optimization (TANGO), that converges to a true natural gradient descent in the limit of small learning rates, without explicit Fisher matrix estimation. For quadratic models the algorithm is also an instance of averaged stochastic gradient, where the parameter is a moving average of a “fast”, constant-rate gradient descent. TANGO...
متن کاملNonlinear Optimization of Exponential Family Graphical Models
This project explores methods for carrying out projections arising in the information geometry of the exponential family of probability models. Kullback-Leibler divergence serves as the distance measure between probability models in this context. The applications include maximum likelihood parameter estimation given sample paths of an unknown density as well as model reduction where one wishes ...
متن کاملMethods for advancing combinatorial optimization over graphical models
OF THE DISSERTATION Methods for advancing combinatorial optimization over graphical models By Natalia Flerova Doctor of Philosophy in Computer Science University of California, Irvine, 2015 Rina Dechter, Chair Graphical models are a well-known convenient tool to describe complex interactions between variables. A graphical model defines a function over many variables that factors over an underly...
متن کاملToward parallel search for optimization in graphical models
We introduce a strategy for parallelizing a state-of-the-art sequential search algorithm for optimization on a grid of computers. Based on the AND/OR graph search framework, the procedure exploits the structure of the underlying problem graph. Worker nodes concurrently solve subproblems that are generated by a single master process. Subproblem generation is itself embedded into an AND/OR Branch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2019
ISSN: 1556-5068
DOI: 10.2139/ssrn.3387874